Mixed E-duality for E-differentiable Vector Optimization Problems Under (Generalized) V-E-invexity
نویسندگان
چکیده
Abstract In this paper, a class of E -differentiable vector optimization problems with both inequality and equality constraints is considered. The so-called mixed -dual problem defined for the considered constraints. Then, several -duality theorems are established under (generalized) V - -invexity hypotheses.
منابع مشابه
Non-differentiable multiobjective mixed symmetric duality under generalized convexity
* Correspondence: lijueyou@163. com Department of Mathematics, Chongqing Normal University, Chongqing, 400047, PR China Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems...
متن کاملVector optimization problems under d-invexity on Riemannian manifolds
The concept of d−invexity for functions defined on Riemannian manifolds is introduced. Then, this notion is used to obtain optimality conditions for vector optimization problems on Riemannian manifolds. M.S.C. 2010: 58E17, 90C26.
متن کاملSymmetric duality for multiobjective fractional variational problems with generalized invexity
The concept of symmetric duality for multiobjective fractional problems has been extended to the class of multiobjective variational problems. Weak, strong and converse duality theorems are proved under generalized invexity assumptions. A close relationship between these problems and multiobjective fractional symmetric dual problems is also presented. 2005 Elsevier Inc. All rights reserved.
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملGeneralized Invexity and Duality in Multiobjective Programming Problems
In this paper we consider a multiobjective optimization problem, and we prove Mond-Weir duality results under second-and higher-order conditions of the objective and constraint functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Forum
سال: 2021
ISSN: ['2662-2556']
DOI: https://doi.org/10.1007/s43069-021-00074-z